\line{\bf TRIVIA HUNT\hfil CS304, January 1987}
\medskip
\centerline{(For full credit, all answers should be documented)}
\bigskip

\newcount\n
\def\\{\medbreak
\advance\n by 1 \item{\bf\number\n.\enspace}}
\def\=#1!{{\unskip\nobreak\hfil\penalty50\hskip2em\hbox{}\nobreak
 \hfil\sl#1\/\parfillskip=0pt\finalhyphendemerits=0\par}}

\\Who taught this course in 1971? In what room did it meet? What color are
the walls and doors of that room painted now?\=15 points each!
% Bob Floyd. Polya room 204. Off-white walls, dark blue doors.
% One of the problems was to estimate lim (number of nonintersection paths
% of length n)↑{1/n}

\\Who received the first two PhD's in Mathematics from Stanford?\=10 points each!
In what years did they finish their work?\=10 points each!
% Manning, 1906. Vern James, 1927. [Stanford dissertations AS36 S7]

\\Who received the first two PhD's
 in Computer Science from Stanford?\=5 points each!
In what year did they finish their work?\=5 points!
% William McKeeman and Raj Reddy, 1966
% (Causey, Grace, Moler, Rudin earlier in CS division of math...)

\\What was the title of John McCarthy's PhD thesis?\=10 points!
How many pages long was it?\=10 points!
% Projection Operators and Partial Differential Equations.
% Princeton University, 1951. 28 pages.
% [Dissertation Abstracts 15 (1955), p601]

\\When did Gene Golub celebrate his 13th birthday?\=8 points!
% February 29, 1984.

\\Of what journal is Leo Guibas the problem section editor?\=12 points!
% Journal of Algorithms

\\Give the titles, co-authors, and years of publication of each book
by Jeff Ullman.\=4 points each!
% according to Socrates,
% with Hopcroft, Formal Languages and their Relation to Automata, 1969
% with Aho, Theory of Parsing, Translation, and Compiling, vol 1, 1972
% with Aho, Theory of Parsing, Translation, and Compiling, vol 2, 1973
% with Aho and Hopcroft, Design and Analysis of Computer Algorithms, 1974
% Fundamental Concepts of Programming Systems 1976
% with Aho, Principles of Compiler Design, 1977
% with Hopcroft, Introduction to Automata, Languages, and Computers, 1979
% Principles of Database Systems, 1979
% with Aho and Hopcroft, Data Structures and Algorithms, 1983
% Principles of Database Systems, 2nd ed, 1983
% Computational Aspects of VLSI, 1984
% with Aho and Sethi, Compilers, 1986

\\What was Don Knuth's first scientific publication?\=10 points!
% The Potrzebie System of Weights and Measures, MAD magazine 33 (June 1957), 36--37.

\\What faculty member in our department wrote a PhD thesis about game theory?
\=20 points!
% Nils John Nilsson, EE 1959 (see general library card catalog)

\\Which faculty members in our department had thesis advisors who have
won the ACM Turing award? \=20 points for each correct triple (faculty name,
advisor name, year of Turing award)!
% Binford's advisor was at Wisconsin
% Buchanan's was somebody at Michigan, not well known
% Cheriton's was Michael Malcolm
% Feigenbaum's was Herb Simon*
% Genesereth's was Joel Moses informally(?) but somebody at Harvard officially
% Golub's was at Illinois
% Guibas's was Knuth*
% Gupta's was somebody I don't know although Newell was on his committee
% Hennessy's was at Stony Brook, Richard Kieburtz
% Katevenis's was probably not a winner
% Lantz's was Feldman
% Latombe's was in Grenoble
% Manna's was Floyd*
% Mayr's was M Paul
% Oliger's was in Sweden
% Papa's was Stieglitz
% Pratt's was Knuth*
% Rosenbloom's was Newell*
% Shoham's was McDermott
% Ullman's was at Princeton EE, Archie McKellar officially signed,
%  Art Bernstein officially advised earlier, Bob Chien (Yorktown) really advised
% Wiederhold's was Starkweather at UCSF
% Winograd's was Papert
% Turing winners were:
% Perlis 66, Wilkes 67, Hamming 68, Minsky 69, Wilkinson 70, McCarthy 71,
% Dijkstra 72, Bachman 73, Knuth 74, Newell&Simon 75, Rabin&Scott 76,
% Backus 77, Floyd 78, Iverson 79, Hoare 80, Codd 81, Cook 82,
% Thompson&Ritchie 83, Wirth 84, Karp 85, Hopcroft&Tarjan 86

\\Identify the author and source of the following quotations:\=10 points for
each author!\=15 points for each source!
\vskip-6pt
\itemitem{a.}Right as a serpent hit him under floures\hfil\break
Til he may seen his tyme for to byte \dots
% Chaucer, the Squieres Tale, lines 512--513.
\smallskip
\itemitem{b.}The upper pointer is stepped down, and proceeds on its downward scan
of the data. When it finds an item with key lower than the bound, this item is
copied into the locations referred to by the lower pointer. The lower
pointer is then stepped up, and the process is repeated until both pointers
are referring to the same item.
% Hoare, Computer Journal 5 (1982), p13
\smallskip
\itemitem{c.}The most valuable acquisitions in a scientific or technical
education are the general-purpose mental tools which remain serviceable
for a lifetime.  I rate natural language and mathematics as the most
important of these tools, and computer science as a third.
% Forsythe, AMM 75 (1968), p456; quoted by Knuth in CACM 15 (1972), p722

\\What were the titles and dates of Stanford CS reports number 1
 and number 1000? Of Stanford AI~memo number 1? \=5 points each!
Were any of these three subsequently published in journals?
\=10 points for each journal citation!
% CS 1 Primal Partition Programming for Block Diagonal Matrices by J B Rosen
% Nov 8, 1963
% published in Numer Math 6 (1964), 250--260
% CS 1000 Implementation of Logical Query languages for databases by J D Ullman
% May 1984
% published in ACM Transactions on Databases 10 (1985), 289-321. [SCI]
% AIM 1: Predicate Calculus with `undefined' as a truth value, JMC, March 1963
% never published

\\What integer number does the bit pattern 101011100010111000101110001011100011
represent in a
DEC-2060 computer?\=3 points for the correct answer, in decimal notation!
What floating-point number does it represent?\=7 points for the correct
answer, in decimal notation!
% -21963283741, and -21963283712 +/- 128. (This and its negative
% are the only self-referencing numbers!)

\\Where did Seidel publish his method for solving linear systems by iteration?
\=10 points for correct reference, plus 15 points for copy of first page!
What was his full name? What were the dates of his birth and death?
\=7 points each!

\\What is the number of the patent on the ENIAC?\=10 points!
How many claims did it have?\=10 points!
When was it filed, and when was it awarded?\=10 points!
When was it invalidated?\=15 points!
% see xerox page
% invalidated October 19, 1973 [Ann Hist Comput 3 (1981) p389]

\\What city has been the site of both a STOC and a FOCS conference, since 1976?
\=15 points!
% Providence was STOC 85 and FOCS 77
% Berkeley was FOCS 75 and STOC 86, doesn't quite make it

\\Find all journal articles published in 1982 whose title contains the
word `multigraphs'.\=10 points for each correct citation, plus 5 points
for each copy of the first page!
% I've got three

\\The fundamental reference to the theory of multigrades is a book
by Albert Gloden called {\sl Mehrgradige Gleichungen\/} published in
the 40s. Find a review of this book in English.\=10 points for a xerox copy!
Find all references to this book made in scientific papers since 1976.
\=15 points each!
% I've got two

\\The longest known multigrades were first published in 1942, in a journal
called {\sl Gazeta Matematica}. What university libraries in the United States
contain the 1942 issue of that journal?\=10 points each!
% Chicago, Harvard, Columbia, Brown, see sheet

\\Find the longest words in the English language with the following
respective properties: (1)~All the letters are distinct (e.g.,
{\tt absorptively}). (2)~The word is a palindrome (e.g., {\tt madam}).
(3)~The letters of the word are sorted in nondecreasing order
(e.g., {\tt accept}). (4)~The letters of the word are sorted in
nonincreasing order (e.g., {\tt rookie}). (5)~The letters all appear
on the upper row of a typewriter keyboard (e.g., {\tt typewriter}).
Note: If your words are not commonly known, you must state their meaning and
give the name of a standard English dictionary that lists them.
\=12 points for each category, provided that no longer word
has been found by other teams!

\\What are synonyms of `{\tt cretinous}' in hackerese?\=5 points for each
documented answer!
% bletcherous, bagbiting, losing, brain-damaged; possibly also
% chomping, barfucious, according to the Hacker's Dictionary

\\List all computers at Stanford that run the TOPS-20 operating system,
and tell in what building they are located.\=4 points for each correct
name and 6 points for each correct location!
% csli pine
% sierra durand
% macbeth ceras
% how gsb
% why gsb
% lear (lots-a) ceras
% othello (lots-b) ceras
% hamlet (lots-c) ceras
% score MJH
% sushi MJH
% truffle MJH

\\Where is it possible to see a life-size painting of Leland Stanford, Jr.,
at age~15?
Who was the artist? When was it painted?\=8 points each!
% in the Stanford Museum, painted by Felix Chary of Paris in 1884

\\In what year was Margaret Jacks born?\=5 points!
What college did she attend?\=15 points!
What was her middle name?\=20 points!
What is the connection between her name and a popular food item?\=20 points!
% 1875, according to portrait in hall
% Radcliffe, according to statement at dedication (easily found in Archives)
% Anna, according to biography of her father by Arthur Bester
% Monterey Jack cheese named after the Jacks family, who owned dairy
% lands, according to Paul Hanna's reminiscences, but I have no documentation

\\What company was co-founded by Fletcher Jones?\=10 points!
 What is his connection with our department?\=10 points!
% He founded Computer Sciences Corporation about 1959, which was the first
% (or nearly first) software company. He established the Jones Foundation,
% before his death in a private plane crash in 1972. That Foundation
% endowed the first chair in our department in 1977.
% Ref: Endowed professorships at Stanford

\\What is the origin of the LISP terms `{\tt car}' and `{\tt cdr}'?\=10 points!
% contents of address register and decrement register in IBM 704-709-7090-7094

% not used: identify the programming language
% not used: last word in reverse alphabetic order is BRUZZ
\bye